Quantization for hybrid video coding

ABSTRACT

Method for coding a video signal using hybrid coding, comprising: reducing temporal redundancy by block based motion compensated prediction in order to establish a prediction error signal; performing quantization on samples of the prediction error signal or on coefficients resulting from a transformation of the prediction error signal into the frequency domain to obtain quantized values, representing quantized samples or quantized coefficients respectively; calculating a quantization efficiency for the quantized values; calculating a zero efficiency for a quantization, when the quantized values are set to zero; selecting the higher efficiency; and maintaining the quantized values or setting quantized values to zero, for further proceeding, depending on the selected efficiency.

FIELD OF THE INVENTION

The invention relates to a method of coding, coder and decoder involvingquantization for hybrid video coding and data signals.

BACKGROUND OF THE INVENTION

Up to date standardized video coding methods are based on hybrid coding.Hybrid coding provides a coding step in the time domain and a codingstep in the spatial domain. First, the temporal redundancy of videosignals is reduced by using a block based motion compensated predictionbetween the image block to be coded and a reference block from an imagethat has already been transmitted determined by a motion vector. Theremaining prediction error samples are arranged in blocks and aretransformed into the frequency domain resulting in a block ofcoefficients. These coefficients are quantized and scanned according toa fixed and well-known zigzag scanning scheme, which starts with thecoefficient representing the DC value. According to a typicalrepresentation, this coefficient is positioned among the low frequencycoefficients in the top left corner of a block. The zigzag scanningproduces a one-dimensional array of coefficients, which areentropy-coded by a subsequent coder. The coder is optimised for an arrayof coefficients with decreasing energy. Since the order of coefficientswithin a block is predetermined and fixed, the zigzag scanning producesan array of coefficients of decreasing energy, if the prediction errorsamples are correlated. The subsequent coding step may then be optimisedfor such a situation. For this purpose, the latest standard H.264/AVCproposes Context-Based Adaptive Binary Arithmetic Coding (CABAC) orContext-Adaptive Variable-Length Coding (CAVLC). However, the codingefficiency of the transform is only high, if the prediction errorsamples are correlated. For samples being only marginally correlated inthe spatial domain, the transform is less efficient.

The spatial redundancy may be reduced by blockwise transform coding ofthe resulting prediction error. For the purpose of transform coding,H.264/AVC applies an integer transform for coding a macroblock of 16×16picture elements, which is similar to the Discrete Cosine Transform. Thesize of the transform can be changed for each macroblock between 8×8 or4×4 picture elements, signaled by side information. In the first case, 48×8 transforms and in the second case, 16 4×4 transforms are applied forthe macroblock. Dependent on the size of the applied transform differentquantizations procedures are performed. Most of the encoding strategiesthat are applied in the official reference software are described inK.-P. Lim, G. Sullivan, T. Wiegand, “Text description of Joint ModelReference Encoding Methods and Decoding Concealment Methods”, JointVideo Team (JVT), doc. JVT-K049, Munich, Germany, March 2004.

In the case of an 8×8 transform the quantization is performed in theofficial reference software as follows. For each of the four 8×8prediction error blocks B_(j) (j=0, . . . , 3) of a macroblock thetransform is performed resulting in a block of 8×8 coefficients c_(k,j)(k=0, . . . , 63). Each coefficient is quantized by a scalar quantizeras shown in FIG. 1. The quantized coefficients c′_(k,j) (k=0, . . . ,63, j=0, . . . , 3) are scanned by the well known Zigzag scan startingat the DC-coefficient resulting in a one dimensional array of 64quantized coefficients c′_(k,j).

Subsequent to these coding steps, a second quantization step isperformed in order to prevent that single quantized coefficients unequalto zero in an 8×8 block are coded. The coding of these single quantizedcoefficients unequal to zero may require a high data rate and may reducethe distortion only marginally. For this purpose, a value I_(k,j),characterizing the importance of the quantized coefficient, isassociated to each of the 64 quantized coefficients. Three cases aredistinguished. If a quantized coefficient has an absolute value of one,the value I_(k,j) is dependent on the number N_(k,j) of preceding zerocoefficients. The dependency between I_(k,j) and N_(k,j) is shown in thefollowing table 1:

TABLE 1 N_(k,j) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 I_(k,j) 3 3 3 3 22 2 2 2 2 2 2 1 1 1 1 N_(k,j) 16 17 18 19 20 21 22 23 24 25 26 27 28 2930 31 I_(k,j) 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0

Accordingly, if a quantized coefficient has an absolute value of one andthere are 3 or less preceding zero coefficients, the valuecharacterizing the importance of the corresponding quantized coefficientis set to 3. If there are 24 or more preceding zero coefficients thevalue characterizing the importance of the corresponding coefficient isset to 0.

For each of the 64 quantized coefficients c′_(k,j), which has anabsolute value larger than one, I_(k,j) is set to a very large valuesuch as 999999. For each of the 64 quantized coefficients c′_(k,j),which is zero, I_(k,j) is set to zero. All 64 values I_(k,j) are addedresulting in the sum

$I_{j} = {\underset{k = 0}{\sum\limits^{63}}{I_{k,j}.}}$In the case that the sum I_(j) is smaller than the threshold 5, allquantized coefficients of the 8×8 block are set to zero and consequentlyI_(j) is also set to zero.

After the determination of the values I₁, I₂, I₃, and I₄ of the four 8×8prediction error blocks B₁, B₂, B₃, and B₄ these four values are addedresulting in the sum I_(MB) for the whole Macroblock. In the case thatI_(MB) is smaller than the threshold 6, all 256 quantized coefficientsof the Macroblock are set to zero.

In case of an 4×4 transform the quantization is performed as follows.Each 8×8 predication error block B_(j) (j=0, . . . , 3) of a Macroblockis divided into four 4×4 blocks P_(j,i) (j=0, . . . , 3, i=0, . . . ,3). For each of the four 4×4 blocks, the transform is performedresulting in a block of 4×4 coefficients c _(k,j,i) (k=0, . . . , 15,j=0, . . . , 3, i=0, . . . 3). Each coefficient is quantized by a scalarquantizer as shown in FIG. 1. The quantized coefficients c′_(k,j,i) ofeach of the four 4×4 blocks are zigzag scanned starting at theDC-coefficient resulting in a one dimensional array of 16 quantizedcoefficients c′_(k,j,i).

Subsequent to these coding steps, a second quantization step isperformed in order to prevent that single quantized coefficients unequalto zero in an 8×8 block are coded. In this second quantization step, all64 quantized coefficients of the four 4×4 blocks of the 8×8 block aretaken into account. For the quantization purpose, a value I_(k.j,i) isassociated to each of the 64 coefficients. Three cases aredistinguished. If a quantized coefficient has an absolute value of one,the value I_(k,j,i) is dependent on the number N_(k,j,i) of precedingzero coefficients. The dependency between I_(k,j,i) and N_(k,j,i) isshown in the following table 2:

TABLE 2 N_(k,j,i) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 I_(k,j,i) 3 2 21 1 1 0 0 0 0 0 0 0 0 0 0

For each of the 64 quantized coefficients c′_(k,j,i), which has anabsolute value larger than one, I_(k,j,i) is set to a very large valuesuch as 999999. For each of the 64 quantized coefficients c′_(k,j,i),which is zero, I_(k,j,i) is set to zero. All 64 values I_(k,j,i) areadded for each 8×8 prediction error block B_(j) resulting in the sum

$I_{j} = {\underset{i = 0}{\sum\limits^{3}}{\underset{k = 0}{\sum\limits^{15}}{I_{k,j,i}.}}}$In the case that the sum I_(j) is smaller than the threshold 5, allquantized coefficients of the 8×8 block are set to zero and consequentlyI_(j) is also set to zero.

After the determination of the values I₁, I₂, I₃ and I₄ of the four 8×8prediction error blocks B₁, B₂, B₃, and B₄, these four values are addedresulting in the sum I_(MB) for the whole macroblock. In the case thatI_(MB) is smaller than the threshold 6, all 256 quantized coefficientsof the macroblock are set to zero.

Accordingly, in the case of an 8×8 transform as well as in the case ofan 4×4 transform coefficients of prediction error blocks are quantizedand a further quantization step is performed in order to prevent thatsingle quantized coefficients unequal to zero in a 8×8 block are coded.Therefore, rules are given for setting some coefficients to zero, whichare considered to be of minor relevance, in order to significantlyreduce the data rate while at the same time the distortion would only beincreased marginally. However, this known procedure is unsatisfactory.

SUMMARY OF THE INVENTION

Therefore, an object of the present invention is to provide an enhancedquantization for hybrid video coding.

According to an aspect of the present invention a method is provided forcoding a video signal using hybrid coding, comprising reducing temporalredundancy by block based motion compensated prediction in order toestablish a prediction error signal, performing a quantization on theprediction error signal or on coefficients resulting from atransformation of the prediction error signal into the frequency domainto obtain quantized values, representing quantized samples or quantizedcoefficients respectively calculating a quantization efficiency for thequantized values calculating a zero efficiency for a quantization, whenthe quantized values are set to zero, selecting the higher efficiencyand maintaining the quantized values or setting the quantized values tozero, for further proceeding, depending on the selected efficiency.

Accordingly, for reducing temporal redundancy a prediction error signalis established by block based motion compensated prediction. For thecoding a quantization is fulfilled based on this prediction error signalto obtain quantized values. This quantization can be performed directlyon the prediction error signal resulting in first quantized samples inthe spatial domain. According to a further possibility the predictionerror signal is first transformed into the frequency domain, resultingin coefficients. Subsequently, the quantization is performed on thesecoefficients, resulting in quantized coefficients. In a further step,the result of this quantization should be enhanced. I.e. some values(samples or coefficients) should be set to zero before being coded. Thisis useful for samples or coefficients respectively, that require a highdata rate but may reduce the distortion_only marginally. Therefore, aquantization efficiency for the quantization is calculated. I.e. acalculation is performed, taking into account the effort and the benefitof maintaining the quantized values. This quantization efficiency iscompared with a zero efficiency. The zero efficiency is calculated forthe case, when the quantized values (samples or coefficientsrespectively) are set to zero. I.e. comparing with a zero efficiencytakes into account, that the effort for coding samples or coefficientsmight be small but on the other hand, there is also provided adisadvantage with respect to the quality of the coded signal.

Subsequently, the quantization efficiency and the zero efficiency arecompared to each other. Accordingly, if the efficiency for maintainingthe quantized values of the quantization is better than the efficiencyfor setting all the quantized values to zero, than the quantized valuesare kept as they are. On the other hand, if the efficiency for settingthe first quantization values to zero is better, than the correspondingquantized values are set to zero.

Accordingly, to proper decide whether to set all quantized values(samples or coefficients) to zero or to keep them as they are anefficiency is calculated for both possibilities. Accordingly, theinvention provides an optimization of the quantization of samples orcoefficients respectively which always selects the best out of twosolutions with respect to an calculated efficiency. The method takesboth possibilities to proceed into account and thus avoids selecting achoice, which is alleged to be a good choice even if the other choiceturns out to be even better.

According to an aspect of the present invention the error signalcomprises macroblocks. The method for coding is performed for onemacroblock at a time. Each macroblock is subdivided into a plurality ofsubblocks. E.g. a macroblock comprises 16×16 picture elements and issubdivided into four 8×8 subblocks. The first quantization is thenperformed on each of these subblocks. If a transformation into thefrequency domain is involved, this is performed on the subblocks beforequantization.

Subsequently, for each subblock a quantization efficiency for the firstquantization and a zero efficiency for a quantization are calculated,when all quantized values (samples or coefficients) are set to zero.These efficiencies are compared for each subblock, in order to decide ifthe quantized values of the corresponding subblock are maintained or setto zero. Subsequently, an overall quantization efficiency for thequantization of all subblocks of the macroblock and an overall zeroefficiency for an overall quantization when all values (samples orcoefficients) of the macroblock are set to zero are calculated. Theseoverall efficiencies for the macroblock are compared and accordingly,quantized values for the further proceeding are determined. I.e. thequantized values are kept as they are, if the overall quantizationefficiency is better than the overall zero efficiency and all thequantized values (samples or coefficients) are set to zero in the othercase.

According to an aspect of the invention the calculation of theefficiency is based on a cost function. Such a cost function takesnegative and positive effects of the corresponding quantization orsetting to zero of values into account.

According to one aspect the cost function is based on rate distortioncosts, whereby the rate distortion costs are calculated depending on therequired rate on the one hand and the resulting distortion on the otherhand. The required rate_for coding is the sum of all bits required forcoding of the values of the corresponding block, which may include somebits for side information.

A further aspect of the invention provides, that the rated distortioncosts are based on the sum of the required rate and a rated distortion.Therefore, a value for each efficiency will be obtained by adding therequired rate and the distortion, whereby the distortion is weighted.The weighting of the distortion may depend on one or more parameterssuch as the quantizer step size. Of course, the required rate can alsobe rated or the required rate can be rated instead of rating thedistortion.

According to an aspect of the invention the rate distortion costs C_(j)are calculated using the equation C_(j)=D_(j)+L*R_(j), whereby D_(j)represents the distortion resulting from the quantization, R_(j)represents the rate required for the coding of the quantized values, Lis a Lagrange parameter and the Index j depicts the correspondingsubblock. The distortion may be calculated as the sum of the squaredquantization errors or the mean absolute quantization error. Of course,there are other possibilities to evaluate the distortion.

According to one aspect of the invention the method provides deciding,whether to transform the prediction error signal into the frequencydomain or to maintain the prediction error signal in the spatial domain.Additionally the method provides to check a third possibility i.e.setting the values (samples or coefficients) of the prediction errorsignal to zero. Accordingly, the invention according to this aspectprovides to select between this three possibilities. This selection isdone for each block, such as a macroblock for which a prediction errorsignal has been generated.

If it is selected, to set the values (samples or coefficients) of theprediction error signal to zero, i.e. of the current block, the resultcan be handled as a prediction error signal in the spatial domain or asa transformed prediction error signal in the frequency domain.

According to one aspect of the present invention a coder for coding avideo signal using hybrid coding is provided, comprising: means forreducing the temporal redundancy by block based motion compensatedprediction in order to establish a prediction error signal, quantizationmeans for quantizing the prediction error signal in order to establishquantized samples or coefficients, control means adapted to calculateand to compare a quantization efficiency and a zero efficiency in orderto select the quantization resulting in the higher efficiency and toeither maintain the quantized samples or quantized coefficientsrespectively or to set them to zero, depended on the selectedquantization.

According to an aspect of the present invention, a method for coding avideo signal is provided being based on hybrid coding. The methodcomprises the steps of reducing temporal redundancy by block basedmotion compensated prediction in order to establish a prediction errorsignal, and deciding whether to transform the prediction error signalinto the frequency domain, or to maintain the prediction error signal inthe spatial domain.

According to a corresponding aspect of the present invention, a coder isprovided, which is adapted to apply hybrid coding of a video signal. Thecoder includes means for reducing the temporal redundancy by block basedmotion compensated prediction in order to establish a prediction errorsignal, and means for deciding whether to transform the prediction errorsignal into the frequency domain, or to maintain the prediction errorsignal in the spatial domain. According to this aspect of the invention,a concept and corresponding apparatuses, signals and semantics areprovided to decide adaptively whether to process the prediction errorsignal in the frequency or in the spatial domain. If the predictionerror samples have only small correlation, the subsequent steps ofcoding the samples may be more efficient and they would lead to areduced data rate compared to coding the coefficients in the frequencydomain. Therefore, an adaptive deciding step and adaptive control meansto make the decision are implemented by the present invention.Accordingly, in view of the prediction error signal, it is decidedwhether to use frequency domain transform or to maintain the predictionerror signal in the spatial domain. The subsequent coding mechanisms maybe the same as for the frequency domain, or they may be adaptedespecially to the needs of the samples in the spatial domain.

According to another aspect of the invention, the method for coding avideo signal, and in particular the deciding step is based on a costfunction. Generally, the decision whether to use the coefficients in thefrequency domain or the samples in the spatial domain may be based onvarious kinds of deciding mechanisms. The decision may be made for allsamples within a specific portion of a video signal at once, or e.g.even for a specific number of blocks, macroblocks, or slices. Thedecision may be based on a cost function, as for example a Lagrangefunction. The costs are calculated for both, coding in the frequencydomain and coding in the spatial domain. Additionally, the costs arecalculated for setting the values to zero. The decision is made for thecoding with lower costs.

According to another aspect of the present invention, the cost functionincludes the rate distortion costs for the coding in the spatial and inthe frequency domain. According to still another aspect of theinvention, the rate distortion costs may be calculated by the requiredrate and the resulting distortion weighted by a Lagrange parameter.Further, the distortion measure may be the mean square quantizationerror or the mean absolute quantization error.

According to an aspect of the present invention, the samples in thespatial domain may be coded by essentially the same methods as beingused for the coefficients in the frequency domain. These methods mayinclude the CABAC or CAVLC coding methods. CABAC stands forcontext-based adaptive binary arithmetic coding and CAVLC stands forcontext-adaptive variable length coding. These kinds of coding arepresented in the latest standard H.264/AVC. Accordingly, only little orno adaption of the coding mechanisms is necessary, if the adaptivecontrol means decide to switch between the frequency and the spatialdomain. However, it might also be provided to use different codingschemes for the coefficients in the two domains.

According to another aspect of the invention, a method for coding avideo signal is provided, which is based on hybrid coding. According tothis aspect of the invention, the temporal redundancy is reduced byblock based motion compensated prediction, and the samples of theprediction error signal are provided in the prediction error block inthe spatial domain. The samples are scanned from the prediction errorblock in order to provide an array of samples in a specific order.According to this aspect of the invention it is provided that thescanning scheme is derived from a prediction error image or a predictionimage. The scanning scheme according to this aspect of the inventiontakes account of the effect that the zigzag scan according to prior artfor the frequency domain may not be the most efficient scanning orderfor the spatial domain. Therefore, an adaptive scanning scheme isprovided, which takes account of the distribution of the samples and themagnitude of the samples in the spatial domain. The scanning scheme maypreferably be based on a prediction error image or a prediction image.This aspect of the invention takes account of the most probablepositions of the samples having the highest magnitude and samples beingmost probably zero. As the coding gain for the frequency domain ismainly based on the phenomenon that the low frequency components havelarger magnitudes, and most of the high frequency coefficients are zero,a very effective, variable code length coding scheme like CABAC or CAVLCmay be applied. However, in the spatial domain, the samples having thehighest magnitude may be located anywhere within a block. However, asthe prediction error is usually the highest at the edges of a movingobject, the prediction image or the prediction error image may be usedto establish the most efficient scanning order.

According to an aspect of the present invention, the gradients of theprediction image may be used to identify the samples with largemagnitudes. The scanning order follows the gradients within theprediction image in their order of magnitude. The same scanning order isthen applied to the prediction error image, i.e. the samples in theprediction error image in the spatial domain.

Further, according to still another aspect of the present invention, thescanning scheme may be based on a motion vector in combination with theprediction error image of the reference block. The scan follows themagnitudes of the prediction error in decreasing order.

According to one aspect of the invention, the scanning scheme is derivedfrom a linear combination of the gradient of the prediction image andthe prediction error image of the reference block in combination with amotion vector.

According to another aspect of the present invention, a specific codefor the coding mechanisms, as for example CABAC or the like is usedbased on separately determined probabilities for the coefficients in thefrequency domain or the samples in the spatial domain. Accordingly, thewell-known prior art coding mechanisms may be adapted at least slightlyin order to provide the most efficient coding mechanism for the spatialdomain. Accordingly, the switching mechanism being adaptively controlledin order to code either in the spatial or in the frequency domain may befurther adapted to switch the subsequent coding steps for the samples orcoefficients in the respective domains.

According to an aspect of the present invention, a method for coding avideo signal is provided including a step of quantising the predictionerror samples in the spatial domain by a quantizer, which has eithersubjectively weighted quantization error optimisation or mean squaredquantization error optimization. According to this aspect of theinvention, the quantizer used for quantising the samples in the spatialdomain may be adapted to take account of the subjectively optimal visualimpression of a picture. The representative levels and decisionthresholds of a quantizer may then be adapted based on correspondingsubjective or statistical properties of the prediction error signal.

Further, the present invention relates also to a decoding method and adecoding apparatus in accordance with the aspects set out here above.According to an aspect of the present invention, a decoder is providedincluding adaptive control means for adaptively deciding whether aninput stream of a coded video signal represents the prediction errorsignal of the coded video signal in the spatial domain or in thefrequency domain. Accordingly, the decoder according to this aspect ofthe present invention is adapted to decide for an incoming data stream,i.e. whether the prediction error signal is coded in the frequency or inthe spatial domain. Further, the decoder provides respective decodingmeans for each of the two domains, either the spatial or the frequencydomain.

Further, according to still another aspect of the present invention, thedecoder comprises a scan control unit for providing a scanning orderbased on a prediction signal or a prediction error signal. The scancontrol unit according to this aspect of the invention is adapted toretrieve the necessary information about the scanning order, in whichthe incoming samples of a block have been scanned during coding thevideo signals. Further, the decoder may comprise all means in order toinverse quantise and inverse transform the coefficients in the frequencydomain or to inverse quantise the samples in the spatial domain. Thedecoder may also include a mechanism to provide motion compensation anddecoding. Basically, the decoder may be configured to provide all meansin order to implement the method steps corresponding to the coding stepsexplained here above.

According to still another aspect of the present invention, a datasignal representing a coded video signal is provided, wherein the codedinformation of the prediction error signal in the data signal ispartially coded in the spatial domain and partially coded in thefrequency domain. This aspect of the invention relates to the codedvideo signal, which is a result of the coding mechanisms as set outabove.

Further, according to still another aspect of the invention, the datasignal may include side information indicating the domain in which aslice, a macroblock, or a block is coded, in particular informationwhether a slice, a macroblock or a block is coded in the spatial or inthe frequency domain. As the adaptive control according to the presentinvention provides that the prediction error signal is either coded inthe spatial domain or in the frequency domain, it is necessary toinclude corresponding information into the coded video signal.Therefore, the present invention provides also a specific information,which indicates the domain in which the specific portion, such as aslice, macroblock, or block has been coded. Further, this aspect of theinvention takes also account of the possibility that a whole macroblockor a whole slice may be coded only in one of the two domains. So, if forexample an entire macroblock is coded in the spatial domain, this may beindicated by a single flag or the like. Further, even a whole slice maybe coded only in the frequency or in the spatial domain, and acorresponding indicator could be included for the whole slice into thedata stream. This results in a decreased data rate and a more efficientcoding mechanism for the side information.

BRIEF DESCRIPTION OF THE DRAWINGS

The aspects of the present invention are explained with respect to thepreferred embodiments which are elucidated by reference to theaccompanying drawings.

FIG. 1 shows an illustration of the quantizer which is applied to thecoefficients in the standard H.264/AVC according to the state of theart;

FIG. 2 shows a simplified block diagram of an encoder according to afirst aspect of the present invention;

FIG. 3 shows a flow chart illustrating enhanced quantization accordingto one aspect of the current invention;

FIG. 4. shows a simplified block diagram of an encoder implementingaspects according to the present invention;

FIG. 5 shows a simplified block diagram of a decoder implementingaspects of the present invention;

FIG. 6 shows a scanning scheme according to the prior art;

FIG. 7 shows scanning schemes according to the present invention;

FIG. 8 illustrates the parameters used for an optimized quantizeraccording to the present invention; and

FIG. 9 shows a simplified representation of the measured mean absolutereconstruction error.

DETAILED DESCRIPTION OF THE INVENTION

According to FIG. 2, a prediction signal 4 is subtracted from the inputsignal 1 to provide the prediction error signal 5. The prediction errorsignal 5 is transformed by the transformation block 6 into the signal 8in the frequency domain. Signal 8 is quantized in block 7. The quantizedsignal 20 is input to the entropy coder 13 for encoding, whereby theentropy coder 13 outputs the coded signal 16 to be transmitted, stored,or the like. The quantized signal 20 is also inverse quantized in block10, passed to block 11 to be inverse transformed back into the spatialdomain. Subsequently, the signal output of block 11 is further used forproviding a subsequent prediction signal 4. The frame memory 22, motioncompensation prediction block 3, the motion estimation block 2 as wellas block 17 for encoding the motion information is equal to the blocks122, 103, 102 and 117 according to FIG. 4.

According to the present invention, the quantization block 7 performs anenhanced quantization. Two general embodiments are described below indetail. However, the invention is not restricted to these embodiments.

In both cases a prediction error signal 5 is provided, comprisingmacroblocks having 16×16 picture elements. A 16×16 macroblock isaccording to one embodiment subdivided in four 8×8 blocks or accordingto a further embodiment into 16 4×4 blocks. In the first step, each 8×8block or each 4×4 block respectively is transformed into the frequencydomain by means of the transformation block 6. Accordingly, the signal 8comprises transformed 8×8 blocks or 4×4 blocks respectively.Subsequently, a first quantization of these 8×8 blocks or 4×4 blocks isperformed within the quantization block 7, which further performs theenhanced quantization.

In case of an 8×8 transformation, the method according to an embodimentof the invention operates as follows.

For each of the four 8×8 prediction error blocks B_(j) (j=0, . . . , 3)of a macroblock the transform and the first step of the quantization isperformed in the same way as described in the state of the art. In thisinvention, the subsequent quantization step is enhanced.

For this purpose, the rate distortion costs C_(j)=D_(j)+L·R_(j) arecalculated for each 8×8 block. R_(j) is the required rate, D_(j) theresulting distortion, and L a Lagrange parameter. As distortion measure,the sum of the squared quantization errors is used, but also othermeasures are possible, e.g. the mean absolute quantization error. As aLagrange parameter L, the commonly used Lagrange parameter for the codercontrol of H.264/AVC is applied: L=0.85·2^((QP−12)/3). QP is thequantization parameter which controls the quantizer stepsize Δ.Alternative methods for determining the rate distortion costs arepossible. These costs are compared to the costs C_(j) which result ifall quantized coefficients of the 8×8 prediction error block are set tozero. The quantization resulting in lower costs is chosen.

After the determination of the costs C₁, C₂, C₃, and C₄ of the four 8×8blocks of a macroblock, the sum of the four costs C_(MB) is calculated.This sum is compared to the costs which result if all quantizedcoefficients of the macroblock are set to zero. Again, the quantizationwith lower costs is chosen.

In case of an 4×4 transformation the method according to an embodimentof the present invention operates as follows.

For each of the sixteen 4×4 prediction error blocks B_(j) (j=0, . . . ,15) of a macroblock the transform and the first step of the quantizationis performed in the same way as described in the state of the art. Inthis invention, the subsequent second quantization step is enhanced.

For this purpose, the rate distortion costs C_(j)=D_(j)+L·R_(j) arecalculated for each 4×4 block. R_(j) is the required rate, D_(j) theresulting distortion, and L a Lagrange parameter. As distortion measure,the sum of the squared quantization errors is used, but also othermeasures are possible, e.g. the mean absolute quantization error. As aLagrange parameter L, the commonly used Lagrange parameter for the codercontrol of H.264/AVC is applied: L=0.85·2^((QP−12)/3). QP is thequantization parameter which controls the quantizer stepsize Δ.Alternative methods for determining the rate distortion costs arepossible. These costs are compared to the costs C_(j) which result ifall quantized coefficients of the 4×4 prediction error block are set tozero. The quantization resulting in lower costs is chosen.

After the determination of the costs C₁ to C₁₆ of the sixteen 4×4 blocksof a macroblock, the sum of the sixteen costs C_(MB) is calculated. Thissum is compared to the costs which result if all quantized coefficientsof the macroblock are set to zero. Again, the quantization with lowercosts is chosen.

According to these embodiments, for each 8×8 block or for each 4×4 blockrespectively the rate distortion costs are calculated and compared tothe case, when all coefficients of the corresponding block are set tozero. According to each comparison the coefficients of the correspondingblock are either maintained or set to zero. Additionally, thecorresponding rate distortion costs of each block are kept for furthercalculation. I.e. for each block if the coefficients are maintained as aresult of the comparison the rate distortion costs corresponding tomaintaining the coefficients is kept for further consideration, whereasthe rate distortion costs for setting the coefficients to zero isdismissed. On the other hand, if the decision was to set thecoefficients to zero, also the rate distortion costs corresponding tothe choice of setting the coefficients to zero is kept for furtherconsideration.

When all four 8×8 blocks or all 16 4×4 blocks have been considered and adecision as described above has been taken, a final check on all four8×8 blocks or all 16 4×4 blocks respectively will be performed.Therefore, the distortion costs which have been kept for furtherconsideration are added to get one value. This value is compared to ratedistortion costs for all coefficients of the current macroblock beingset to zero.

FIG. 3 illustrates a method for quantization according to one aspect ofthe invention. The illustrated method starts at step 302 providingsamples of an error prediction signal. These signals are given in amacroblock, which is subdivided in subblocks in step 304. A macroblockmay have the size of 16×16 picture elements and may be subdivided infour subblocks of the size 8×8 or in 16 subblocks of the size 4×4.

The method illustrated in FIG. 3 can basically be performed in thespatial domain or in the frequency domain. For computation in thefrequency domain, each subblock is transformed into the frequencydomain, resulting in a plurality of coefficients. These coefficients areusually also given in a matrix of the same size as the correspondingsubblock. I.e. an 8×8 subblock or a 4×4 subblock in the spatial domainis transformed into the frequency domain resulting in a block of 8×8 or4×4 coefficients respectively.

In step 308, a first quantization is performed either on the samples, ifthe computation is performed in the spatial domain or on thecoefficients, if the calculation is performed in the frequency domain.

The computation in step 308 results in first quantized values. Thesefirst quantized values represent first quantized samples, if thequantization is performed in the spatial domain. If the quantization isperformed in the frequency domain, the first quantized values representfirst quantized coefficients. The following steps of the quantizationare similar for first quantized samples and first quantizedcoefficients. Accordingly, the term quantized value represents bothalternatives.

According to step 310, a quantization efficiency is calculated for thefirst quantized values for the current subblock. In step 310 there isalso calculated a zero efficiency for the current subblock when allvalues of the current subblock are set to zero.

In step 312 the quantization efficiency is compared to the zeroefficiency. If the quantization efficiency is not higher than the zeroefficiency, than all quantized values of the current subblock are set tozero in step 314. Otherwise, the quantized values are maintained as theyare.

In step 316 it is checked, whether the first optimization according tosteps 310-314 has already been performed for all subblocks. Accordingly,the process is branched back to calculating the efficiency in step 310,if steps 310-312 have not yet been performed for all subblocks includingthe last subblock. If the last subblock has been reached, the firstoptimization is complete. Subsequently, an overall efficiency iscalculated for all subblocks of the macroblock according to step 318.Therefore, an overall efficiency is calculated for all the subblocksbased on the result of the efficiency comparison in step 312. I.e. foreach subblock the best efficiency according to the comparison in step312 is added to the best efficiencies of the other subblocks of themacroblock in step 318. Additionally, an overall zero efficiency for themacroblock is also calculated in step 318, whereby all values of themacroblock are set to zero.

The overall quantization efficiency and the overall zero efficiency arecompared in step 320. If the overall quantization efficiency is nothigher than the overall zero efficiency, then all quantized values ofthe macroblock are set to zero in step 320. Otherwise, all quantizedvalues are maintained as they are.

Accordingly, with receiving these quantized values according to thecomparison of step 320 illustrated in FIG. 3 the optimization of thequantization for the current macroblock is complete. The quantizedvalues thus received may be transmitted to a coder e.g. an entropy coderfor encoding.

FIG. 4 shows a simplified block diagram of an encoder according to thepresent invention. Accordingly, the input signal 101 undergoes a motionestimation based on which a motion compensation prediction is carriedout in order to provide a prediction signal 104, which is subtractedfrom the input signal 101. The resulting prediction error signal 105 istransformed into the frequency domain 106 and quantized by an optimisedquantizer 107 for the frequency related coefficients. The output signal120 of the quantizer 107 is passed to an entropy coder 113 whichprovides the output signal 116 to be transmitted, stored, or the like.By means of an inverse quantization block 110 and inverse transformationblock 111, the quantized prediction error signal 120 is further used forthe next prediction step in the motion compensated prediction block 103.The inverse quantized an inverse DCT transformed prediction error signalis added to the prediction signal and passed to frame memory 122 storingpreceding images for the motion compensation prediction block 103 andthe motion estimation block 102. Generally, the present inventionsuggests to use in addition to the prior art an adaptively controlledmechanism 115 to switch between the frequency and the spatial domain fortransforming the prediction error signal 105. The adaptive control means115 produce signals and parameters in order to control the adaptivechange between the frequency and the spatial domain. Accordingly, anadaptive control information signal 121 is asserted to the two switchesswitching between the positions A and B. If the transformation iscarried out in the frequency domain, the two switches are in position A.If the spatial domain is used, the switches are switched to position B.Further, the side information signal 121, i.e. which of the domains hasbeen used for the coding procedure of a picture is also passed to theentropy coder 113. Accordingly, an appropriate information for thedevice is included into the data stream. Parallel to the frequencytransform, via an alternative path, the prediction error signal 105 ispassed to the quantizer 109. This quantization block 109 providesoptimised quantization for the prediction error signal 105 in thespatial domain. The quantized prediction error signal 124 in the spatialdomain may be passed to a second inverse quantization block 112 andfurther to the back connection to the motion compensation predictionblock 103. Additionally, there is a scan control block 114 receivingeither the motion vector 123 and the inverse quantized prediction errorsignal 118, or the prediction signal 104 via connection 119. Block 117serves to encode the motion information.

The adaption control block 115 decides whether a block is to be coded inthe frequency or in the spatial domain, and it generates correspondingside information to indicate the domain. The decision made by theadaption control means is based on the rate distortion costs for thecoding in the spatial and for coding in the frequency domain. The domainhaving the lower rate distortion costs is selected for coding. Forexample, the rate distortion costs C are calculated by the required rateR and the resulting distortion D weighted by a Lagrange parameter L:C=L*R+D. As a distortion measure, the mean squared quantization errormay be used, but also other measures are applicable, as for example themean absolute quantization error. As Lagrange parameter L, the commonlyused Lagrange parameter for the coder control of H.264/AVC may be usedL=0.85*2^(((QP−12)/3)). Alternative methods for determining the ratedistortion costs are possible.

Additionally to deciding whether a block is to be coded in the frequencyor in the spatial domain, it is decided, whether the values (samples orcoefficients) of the corresponding block are all set to zero or not.This decision is also based on the rate distortion costs, but which arecalculated for the case, when all values of the corresponding block areset to zero. Accordingly, there are at least three rate distortion costscalculated. I.e. the rate distortion costs for the coding in the spatialdomain, the rate distortion costs for the coding in the frequency domainand the rate distortion costs for the case when all values are set tozero. The resulting three calculated costs are compared and the codingresulting in the lowest rate distortion costs is selected. For the case,that costs are identical, setting all values to zero is preferred andthen performing the coding in the spatial domain is preferred.

The calculation of the rate distortion costs can be understood as partof the quantization and accordingly, according to one possibility, thecalculation of the rate distortion costs for the coding in the spatialdomain can be performed in block 109, the calculation of the ratedistortion costs for the coding in the frequency domain can be performedin the block 107 and the calculation for the case of setting the valuesto zero can be performed in the block 107 or in the block 109.

According to an aspect of the invention, in particular when a goodprediction signal 104 is expected, only coding in spatial domain couldbe performed, a coder would be used according to FIG. 3, whereasswitches are fixed in position B and blocks 106, 107, 110 and 111 willnot be used at all for this alternative. However, the quantizationperformed in block 109 will be enhanced by deciding depending on ratedistortion costs as described above, to set values of blocks of theerror prediction signal to zero or not.

The adaption control 115 can alternatively control the coding method.This may be done for example based on the prediction signal or based onthe correlation in the prediction error, or based on the domain, theprediction error is coded in at a motion compensated position of alreadytransmitted frames.

FIG. 5 shows a simplified block diagram of an architecture of a decoderaccording to aspects of the present invention. Accordingly, the codedvideo data is input to two entropy decoding blocks 201 and 202. Theentropy decoding block 202 decodes motion compensation information, suchas motion vectors etc. The entropy decoding block 201 applies theinverse coding mechanism used in the coder, as for example decodingaccording to CABAC or CAVLC. If the encoder uses a different codingmechanism for the coefficients or the samples in the spatial domain, thecorresponding decoding mechanism is to be used in the correspondingentropy decoding blocks. Accordingly, the entropy decoding block 201produces the appropriate signals in order to switch between positions Aand B in order to use either the appropriate inverse quantization pathfor the spatial domain, i.e. the inverse quantization operation block206, or the appropriate blocks according to switch position A, i.e. theinverse quantization block 203 and the inverse transform block 204. Ifthe prediction error is represented in the frequency domain, inversequantization block 203 and inverse transformation block 204 apply thecorresponding inverse operations. As the samples in the spatial domainhave been arranged in a specific order in accordance with a scanmechanism according to aspects of the present invention, a scan controlunit 205 provides the correct order of the samples for the entropydecoding block 201. If the encoding has been carried out in the spatialdomain, the inverse transform block 204 and the inverse quantizationblock 203 are bypassed by an inverse quantization operation in block206. The switching mechanism, to switch between frequency and spatialdomain (i.e. position A and B of the switches) is controlled by the sideinformation sent in the bitstream and decoded by the entropy decodingblock 201. Further, the inverse quantized signal in the spatial domain,or the inverse quantized and inverse transformed signal in the frequencydomain are summed with the motion compensated prediction picture inorder to provide the decoded video signals 210. The motion compensationis carried out in block 209 based on previously decoded video signaldata (previous pictures) and motion vectors. The scan control unit 205uses either the prediction image 208, or the prediction error signal 207in combination with the motion vector 212 to determine the correct scansequence of the coefficients. The scan mechanism may also be based onboth pictures, i.e. the prediction error picture and the predictionpicture. As explained for the coding mechanism with respect to FIG. 4,the scan sequence during coding may be based on a combination of theprediction error information 207 and the motion compensation vectors.Accordingly, the motion compensation vectors may be passed via a path212 to the scan control unit 205. Further, in correspondence to FIG. 4,there is a frame memory 211 storing the necessary and previously decodedpictures.

FIG. 6 shows a simplified diagram in order to illustrate the zigzag scanorder according to the prior art. Accordingly, the coefficients, whichare the result of a transform to the frequency domain (for example DCT)are arranged in a predetermined order as shown in FIG. 6 for a four byfour block. These coefficients are read out in a specific order, suchthat the coefficients representing the low frequency portions arelocated in the first left positions of a one-dimensional array. The moreon the bottom right of the array, the higher the correspondingfrequencies of the coefficients. As blocks to be coded often containsubstantial low frequency coefficients, the high frequency coefficients,or at least a majority of high frequency coefficients are zero. Thissituation can effectively be used to reduce the data to transmit it byfor example replacing large sequence of zeros by a single informationabout the number of zeros.

FIG. 7 shows a simplified illustrative example for a scan mechanismaccording to an aspect of the present invention. FIG. 7(a) shows themagnitude of the gradients in the prediction image for one block. Thevalues in each position of the block represent the gradient of theprediction image of the current block. The gradient itself is a vectorconsisting of a two components representing the gradient in horizontaland vertical direction. Each component may be determined by thedifference of the two neighbouring samples or it may be determined bythe well-known Sobel-operator taking six neighbouring samples intoaccount. The magnitude of the gradient is the magnitude of the vector.If two values have the same magnitude, a fixed or predetermined scanorder may be applied. The scanning order follows the magnitude of thegradient values in the block as indicated by the dotted line. Once thescanning order within the gradient prediction image is established, thesame scanning order is applied to the quantized prediction errorsamples, which are shown in FIG. 7(b). If the quantized samples in thespatial domain of the block shown in FIG. 7(b) are arranged in aone-dimensional array as indicated on the left side of FIG. 7(b) inaccordance with the scanning order established based on the magnitude ofthe gradients in the prediction image, the samples having a high valueare typically arranged first in the array, i.e. in the left positions.The right positions are filled with zeros as indicated in FIG. 7(b).

Instead of a scan controlled by the gradient, also other scans as e.g. apredefined scan or a scan controlled by the quantized prediction errorof already transmitted frames in combination with a motion vector, orcombinations thereof can be applied (the scan control relates to blocks114 or 205 as explained with respect to FIG. 4 and FIG. 5). In the caseof a scan controlled by the prediction error signal in combination witha motion vector, the scan follows the magnitudes of the quantizedprediction error samples of the block, the motion vector of the currentblock refers to, in decreasing order.

If the motion vector points to fractional sample positions, the requiredquantized prediction error samples may be determined using aninterpolation technique. This may be the same interpolation technique asused for the interpolation of the reference image in order to generatethe prediction samples.

In the case the scan is controlled by the combination of the predictionimage and the prediction error image in combination with a motionvector, linear combinations of the magnitudes of the gradients and ofthe quantized prediction error samples of the block, the motion vectorof the current block refers to, are calculated. The scan follows thevalues of these linear combinations. In addition, the method for thescan determination can be signalled for segments of the sequence, e.g.for each frame or for each slice or for a group of blocks. According tothe typical standard processing, the motion compensation vectors arealready considered, while the prediction image is determined.

According to another aspect of the present invention, the scanning ordermay also be based on the prediction error picture in combination with amotion vector. Further, combinations of the gradient principle asexplained above and the prediction error picture are conceivable.

FIG. 8 shows a simplified illustration being useful to illustrate thedefinition of an optimised quantizer according to aspects of the presentinvention. Accordingly, the three parameters a, b, and c are theparameters used to adapt the quantizer. According to the standardH.264/AVC, rate distortion optimised quantizers for the coefficientswith two different distortion measures are applied. The first measure isthe mean squared quantization error, the second is the subjectivelyweighted quantization error. According to the H.264/AVC standard, twoquantizers for the prediction error samples are developed. Since thedistribution of the prediction error is close to a Laplaciandistribution, scalar a dead-zone plus uniform threshold quantizer isused in the case of mean squared quantization error optimisation. FIG. 5illustrates the parameters a, b, and c of the quantization and inversequantization.

Table 3 shows the parameters a, b, and c, which may be advantageouslyused for the commonly used QPs (Quantization Parameter) in the H.264/AVCcoding scheme. The parameters a, b, c are the respective optimisedparameters for mean square quantization error optimisation. However,this is only an example, and different or additional parameters may beuseful for different applications.

TABLE 3 Mean squared Subjectively quantization weighted quantizationerror optimisation error optimisation QP a b c r₁ r₂ r₃ r₄ r₅ 23 9.6 1.62.7 0 11 28 46 66 26 14.8 1.4 4.8 0 14 36 58 110 29 22.2 1.4 6.9 0 20 5492 148 32 30.2 1.4 9.3 0 28 76 130 220

For subjectively weighted quantization error optimisation, a non-uniformquantizer is proposed with representative levels r_(i), −r_(i) anddecision thresholds in the middle of adjacent r_(i) which are also shownin table 3. If large prediction errors occur at the edges, visualmasking may be exploited. Accordingly, large quantization errors may beallowed at the edges and small ones if the image signal is flat.H.264/AVC may use more than 4 QPs as shown in Table 3. Then Table 3 hasto be extended. H.264/AVC may use 52 different QPs. The basic idea fordetermining the appropriate representative values r_(i), −r_(i) isexplained here below with respect to FIG. 9.

FIG. 9 shows a simplified representation of the measured mean absolutereconstruction error of a picture element in the case of thesubjectively weighted quantization in the frequency domain in FIG. 9(a)and in the spatial domain in FIG. 9(b). The measured mean absolutereconstruction error of subjectively weighted quantization in thefrequency domain is shown as a function of the absolute value of theprediction error. For the absolute reconstruction error of subjectivelyweighted quantization in the spatial domain, the representation levelsr_(i) are adjusted such that the mean absolute reconstruction error isthe same for quantization in the frequency and spatial domain withrespect to the quantization intervals in the spatial domain. Just as anexample, the values r₁, r₂, r₃, and r₄ for QP=26 as indicated in table 3are also present in FIG. 9(b) As a rule of thumb, a representativelevels r_(i) is approximately doubled if the value QP increases by 6.The quantizer design can also exploit other features of the visualsystem. Furthermore, quantizers can be used to create a quantizationerror with properties different to those of the H.264/AVC quantizers.

Entropy Coding of the Quantized Samples in the Spatial Domain

According to an aspect of the present invention, entropy coding in thespatial domain may be based on the same methods as for the quantizedcoefficients in the frequency domain. For the H.264/AVC standard, twopreferred entropy coding methods are CABAC and CAVLC. However, accordingto this aspect of the present invention, instead of coding the quantizedcoefficients in the frequency domain, quantized samples in the spatialdomain are coded by the above mentioned methods. As explained above, thescanning order may be changed in order to provide the same datareduction as for the frequency domain. As set out above, the scan in thespatial domain may be controlled by the magnitude of the gradient of theprediction image signal at the same spatial position. According to thisprinciple, the samples to be coded are arranged in an order of decreasein gradients, as already explained with respect to FIGS. 7(a) and (b).Other scan mechanisms may also be applied as set out above. Further,separate codes, which means separate probability models in the case ofCABAC, may be used for the spatial domain according to aspects of thepresent invention. The code and in the case of CABAC the initialisationof the probability models may be derived from the statistics of thequantized samples. The context modelling in the spatial domain may bedone in the same way as in the frequency domain.

Coding of the Side Information

The adaptive control means explained with respect to FIG. 4 generatesthe information relating to the domain, in which a block is to be coded.The block size may be four by four or eight by eight picture elementsaccording to the size of the transform. However, according to differentaspects of the present invention, other block sizes independent of thesize of the transform may be applied. According to an aspect of thepresent invention, the side information includes specific flags, whichindicate whether the coding mechanism has adaptively been changed duringcoding. If for example all blocks of a slice are coded in the frequencydomain, this may be indicated by a specific bit in the coded video datasignal. This aspect of the invention may also relate to the blocks of amacroblock, which may all be coded in each of the two domains, or onlyin one domain. Further, the concept according to the present aspect ofthe invention may be applied to macroblocks and information may beincluded in the data stream which indicates whether at least one blockof a macroblock is coded in the spatial domain. Accordingly, the flagSlice_FD_SD_coding_flag may be used to indicate whether all blocks ofthe current slice are coded in the frequency domain, or whether at leastone block is coded in the spatial domain. This flag may be coded by asingle bit. If at least one block of the slice is coded in the spatialdomain, this may be indicated by the flag MB_FD_SD_coding_flag for eachindividual macroblock of the current slice, if all the blocks of thecurrent macroblock are coded in the frequency domain, or if at least oneblock is coded in the spatial domain. This flag may be coded conditionedon the flags of the already coded neighbouring blocks to the top and tothe left. If the last one of a macroblock is coded in the spatialdomain, this may be indicated by the flag FD_or_SD-Flag for each blockof the macroblock to be coded, if the current block is coded in thefrequency or in the spatial domain. This flag may be coded conditionedon the flags of the already coded neighbouring blocks to the top and tothe left. Alternatively, the side information may also be codedconditioned by the prediction signal or the prediction error signal incombination with a motion vector.

Syntax and Semantics

According to this aspect of the present invention, an exemplary syntaxand semantics allowing the incorporation of the aspects of the presentinvention into the H.264/AVC coding scheme is presented. Accordingly,the flag Slice_FD_SD_coding_flag may be introduced in the slice_headeras shown in table 4. The flag MB_FD_SD_coding_flag may be sent in eachmacroblock_layer as shown in table 5. In the residual_block_cabac it maybe signalled by the flag FD_or_SD_flag if the frequency domain coding orspatial domain coding is supplied for the current block, this is shownin table 6 here below. A similar scheme may be applied in other videocoding algorithms for the prediction error coding.

TABLE 4 slice_header( ){ C Descriptor . . . Slice_FD_SD_coding_flag 2u(1) . . .

TABLE 5 Macroblock_layer( ){ C Descriptor . . . If(Slice_FD_SD_coding_flag == 1){   MD_FD_SD_coding_flag 2 u(1), ae(v) { .. .

TABLE 6 residual_block_cabac{ C Descriptor . . . If(Slice_FD_SD_coding_flag == 1 && MB_FD_SD_Coding_flag == 1){  FD_or_SD_flag ¾ u(1), ae(v)   If (FD_or_SD_flag == 1)}   Code_Prediction_error_in_spatial_domain   }   else{   Code_Prediction_error_in_frequency_domain   } } . . .

We claim:
 1. A method for coding a video signal using hybrid coding,comprising: reducing temporal redundancy by block based motioncompensated prediction in order to establish a prediction error signal;performing quantization on samples of the prediction error signal or oncoefficients resulting from a transformation of the prediction errorsignal into the a frequency domain to obtain quantized values,representing quantized samples or quantized coefficients respectively,wherein the prediction error signal includes a plurality of subblockseach including a plurality of quantized values; calculating a firstquantization efficiency for the quantized values of at least onesubblock of the plurality of subblocks; setting the quantized values ofthe at least one subblock to all zeroes; calculating a secondquantization efficiency for the at least one subblock while all of thequantized values are zeroes; selecting which of the first and secondquantization efficiencies is a higher efficiency; and selecting, forfurther proceeding, the at least one subblock with the quantized valuesprior to setting the quantized values of the at least one subblock toall zeroes if the first quantization efficiency is higher and selectingthe at least one subblock with the quantized values set to zero, forfurther proceeding, if the second quantization efficiency is higher. 2.The method according to claim 1, wherein: the prediction error signalcomprises macroblocks, which are subdivided into the plurality ofsubblocks, performing quantization includes performing quantization onsamples of the at least one subblock or the coefficients resulting froma transformation of the at least one subblock into the frequency domainrespectively, and calculating the first quantization efficiency; settingthe quantized values, calculating a second quantization efficiency;selecting which of the first and second quantization efficiencies is ahigher efficiency; selecting, for further proceeding, the at least onesubblock with the quantized values prior to setting the quantized valuesof the at least one subblock to all zeroes if the first quantizationefficiency is higher; and selecting the at least one subblock with thequantized values set to zero, for further proceeding, if the secondquantization efficiency is higher, and selecting steps are performed foreach subblock, the method further comprising: calculating an overallquantization efficiency for quantizing all subblocks of one macroblockof the macroblocks; setting the quantized values of the one macroblockto all zeroes; calculating an overall zero efficiency for quantizingwhile all quantized values of the one macroblock are set to zero;selecting which of overall quantization efficiency and the overall zeroefficiency is higher; selecting, for further proceeding, the onemacroblock with the quantized values prior to setting the quantizedvalues of the one macroblock to all zeroes if the overall quantizationefficiency is higher than the overall zero efficiency; and selecting theone macroblock with the quantized values of the one macroblock set tozero, for further proceeding, if the overall zero efficiency is higherthan the overall quantization efficiency.
 3. The method according toclaim 1, wherein calculating the first and second quantizationefficiencies is based on a cost function.
 4. The method according toclaim 3, wherein the cost function is based on rate distortion costs,whereby the rate distortion costs are calculated depending on the arequired rate and the a resulting distortion.
 5. The method according toclaim 4, wherein the rate distortion costs are based on the a sum of thea distortion and the a weighted required rate.
 6. The method accordingto claim 5, wherein the rate distortion costs C_(j) are calculated usingthe an equation C_(j)=D_(j)+L*R_(j), whereby D_(j) represents theresulting distortion resulting from the quantization, R_(j) representsthe required rate required for quantization, L is a Lagrange parameterand the Index j depicts the corresponding subblock.
 7. The methodaccording to claim 4, wherein the resulting distortion is the a sum ofthe squared quantization errors or the a mean absolute quantizationerror.
 8. The method according to claim 2, whereby the overallquantization efficiency of the on macroblock is the a sum of theselected efficiencies of each subblock.
 9. A method for decoding a videosignal using hybrid coding, wherein the video signal has been codedaccording to claim 1, comprising: decoding coded video data effectivelyin the frequency domain or the a spatial domain, in accordance with thea coding mechanism used for coding the video signal data.
 10. Thedecoding method of claim 9, wherein positions of the prediction errorsignal samples received in a one-dimensional array are assigned tolocations in a two-dimensional arrangement are determined based on apreviously received prediction error signal or prediction image.
 11. Acoder for coding a video signal using hybrid coding, comprising: meansfor reducing temporal redundancy by block based motion compensatedprediction in order to establish a prediction error signal, quantizationmeans for quantizinga quantizer that quantizes the prediction errorsignal in order to establish quantized values representing samples orcoefficients, wherein the prediction error signal includes a pluralityof subblocks, control means for: calculating a first quantizationefficiency of at least one subblock of the plurality of subblocks;setting the quantized values of the at least one subblock to all zeroes;calculating a second quantization efficiency for the at least onesubblock while all of the quantized values are zeroes; selecting whichof the first and second quantization efficiencies is a higherefficiency; and selecting, for further proceeding, the at least onesubblock with the quantized values prior to setting the quantized valuesof the at least one subblock to all zeroes if the first quantizationefficiency is higher and selecting the at least one subblock with thequantized values set to zero, for further proceeding, if the secondquantization efficiency is higher.
 12. The coder according to claim 11,further comprising: transformation means for transforming a frequencytransformer that transforms picture elements of the prediction errorsignal from the a spatial domain into the a frequency domain.
 13. Adecoder for decoding a coded video signal coded by use of hybrid codingaccording to the method of claim 1, comprising: adaptive control meansfor adaptively deciding whether an input stream of the coded videosignal represents the prediction error signal of the coded video signalin the a spatial domain or in the a frequency domain and for decodingthe coded video signal into a quantized prediction error signal; and aninverse quantizer configured to inverse quantize the quantizedprediction error signal.
 14. The method according to claim 1, whereinthe calculating the first quantization efficiency; setting the quantizedvalues; calculating the second quantization efficiency; selecting whichof the first and second quantization efficiencies is a higherefficiency; selecting, for further proceeding, the at least one subblockwith the quantized values prior to setting the quantized values of theat least one subblock to all zeroes if the first quantization efficiencyis higher; and selecting the at least one subblock with the quantizedvalues set to zero, for further proceeding, if the second quantizationefficiency is higher are performed for each subblock.